the combinatorial ant system for dynamic combinatorial optimization problems
نویسندگان
چکیده
In this paper is presented a distributed algorithm based on Ant System concepts, called Combinatorial Ant System, to solve dynamic combinatorial optimization problems. Our approach consists of mapping the solution space of the dynamic combinatorial optimization problem in the space where the ants will walk, and defining the transition probability and the pheromone update formula of the Ant System according to the objective function of the optimization problem. We test our approach on a telecommunication problem.
منابع مشابه
Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملA General Ant Colony Model to solve Combinatorial Optimization Problems
An Ants System is an artificial system based on the behavior of real ant colonies, which is used to solve combinatorial problems. This is a distributed algorithm composed by a set of cooperating agents called ants which cooperate among them to find good solutions to combinatorial optimization problems. The cooperation follows the behavior of real ants using an indirect form of communication med...
متن کاملFORM FINDING FOR RECTILINEAR ORTHOGONAL BUILDINGS THROUGH CHARGED SYSTEM SEARCH ALGORITHM
Preliminary layout design of buildings has a substantial effect on the ultimate design of structural components and accordingly influences the construction cost. Exploring structurally efficient forms and shapes during the conceptual design stage of a project can also facilitate the optimum integrated design of buildings. This paper presents an automated method of determining column layout desi...
متن کامل– Ant System
Ant System, the first Ant Colony Optimization algorithm, showed to be a viable method for attacking hard combinatorial optimization problems. Yet, its performance, when compared to more fine-tuned algorithms, was rather poor for large instances of traditional benchmark problems like the Traveling Salesman Problem. To show that Ant Colony Optimization algorithms could be good alternatives to exi...
متن کاملMAX-MIN Ant System
Ant System, the first Ant Colony Optimization algorithm, showed to be a viable method for attacking hard combinatorial optimization problems. Yet, its performance, when compared to more fine-tuned algorithms, was rather poor for large instances of traditional benchmark problems like the Traveling Salesman Problem. To show that Ant Colony Optimization algorithms could be good alternatives to exi...
متن کامل